Brzozowski type determinization for fuzzy automata
نویسندگان
چکیده
منابع مشابه
Brzozowski type determinization for fuzzy automata
In this paperwe adapt thewell-knownBrzozowskideterminizationmethod to fuzzy automata. Thismethod gives better results than all previously knownmethods for determinization of fuzzy automata developed by Bělohlávek [InformSciences 143 (2002)205–209],Li andPedrycz [FuzzySet Syst 156 (2005)68–92], Ignjatović et al. [Inform Sciences 178 (2008) 164–180], and Jančić et al. [Inform Sciences 181 (2011) ...
متن کاملAn improved algorithm for determinization of weighted and fuzzy automata
For a givenweighted finite automaton over a strong bimonoid we construct its reducedNerode automaton, which is crisp-deterministic and equivalent to the original weighted automaton with respect to the initial algebra semantics.We show that the reducedNerode automaton is even smaller than theNerode automaton, which was previously used in determinization related to this semantics. We determine ne...
متن کاملFurther improvements of determinization methods for fuzzy finite automata
In this paper we combine determinization and state reduction methods into two-in-one algorithms that simultaneously perform determinization and state reduction. These algorithms perform better than all previous determinization algorithms for fuzzy finite automata, developed by Bělohlávek [Inform Sciences 143 (2002) 205–209], Li and Pedrycz [Fuzzy Set Syst 156 (2005) 68–92], Ignjatović et al. [I...
متن کاملDeterminization of Parity automata
A central result in the theory of ω-automata is McNaughton's Theorem which states that every Buchi automaton is equivalent to a deterministic Muller automaton. The complexity of McNaughton's algorithm is huge. Safra provided an optimal construction. Safra's algorithm converts a Buchi automaton with n states to a deterministic Rabin automaton with n states. Much e orts have been invested to redu...
متن کاملDeterminization of Parity automata
A central result in the theory of ω-automata is McNaughton's Theorem which states that every Buchi automaton is equivalent to a deterministic Muller automaton. The complexity of McNaughton's algorithm is huge. Safra provided an optimal construction. Safra's algorithm converts a Buchi automaton with n states to a deterministic Rabin automaton with n states. Much e orts have been invested to redu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fuzzy Sets and Systems
سال: 2014
ISSN: 0165-0114
DOI: 10.1016/j.fss.2014.02.021